Almost sure invariance principles via martingale approximation
نویسندگان
چکیده
منابع مشابه
Almost Sure Invariance Principle for Random Piecewise Expanding Maps
The objective of this note is to prove the almost sure invariance principle (ASIP) for a large class of random dynamical systems. The random dynamics is driven by an invertiblemeasure preserving transformation σ of (Ω,F ,P) called the base transformation. Trajectories in the phase space X are formed by concatenations f ω := fσn−1ω ◦ · · · ◦ fσω ◦ fω of maps from a family of maps fω : X → X, ω ∈...
متن کاملAlmost Sure Invariance Principle for Nonuniformly Hyperbolic Systems
We prove an almost sure invariance principle that is valid for general classes of nonuniformly expanding and nonuniformly hyperbolic dynamical systems. Discrete time systems and flows are covered by this result. In particular, the result applies to the planar periodic Lorentz flow with finite horizon. Statistical limit laws such as the central limit theorem, the law of the iterated logarithm, a...
متن کاملInvariance Principles in Metric Diophantine Approximation
In [7], LeVeque proved a central limit theorem for the number of solutions p, q of ∣∣∣∣x− pq ∣∣∣∣ ≤ f(log q) q2 subjected to the following conditions 0 < q ≤ n, (p, q) ≤ d, where x ∈ [0, 1] and f satisfies certain assumptions. The case d = 1 was considerably improved a few years later by Philipp [8]. We give a common extension of both results by proving almost sure and distribution type invaria...
متن کاملAlmost Sure Productivity
We define Almost Sure Productivity (ASP), a probabilistic generalization of the productivity condition for coinductively defined structures. Intuitively, a probabilistic coinductive stream or tree is ASP if it produces infinitely many outputs with probability 1. Formally, we define almost sure productivity using a final coalgebra semantics of programs inspired from Kerstan and König. Then, we i...
متن کاملBeyond Almost-Sure Termination
The aim of this paper is to argue that models in cognitive science based on probabilistic computation should not be restricted to those procedures that almost surely (with probability 1) terminate. There are several reasons to consider nonterminating procedures as candidate components of cognitive models. One theoretical reason is that there is a perfect correspondence between the enumerable se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 2012
ISSN: 0304-4149
DOI: 10.1016/j.spa.2011.09.004